skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Creators/Authors contains: "Aldroubi, Akram"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Abstract This paper investigates the problem of recovering source terms in abstract initial value problems (IVP) commonly used to model various scientific phenomena in physics, chemistry, economics, and other fields. We consider source terms of the form$$F=h+\eta $$ F = h + η , where$$\eta $$ η is a Lipschitz continuous background source. The primary objective is to estimate the unknown parameters of non-instantaneous sources$$h(t)=\sum \limits _{j=0}^M h_je^{-\rho _j(t-t_j)}\chi _{[t_j,\infty )}(t)$$ h ( t ) = j = 0 M h j e - ρ j ( t - t j ) χ [ t j , ) ( t ) , such as the decay rates, initial intensities and activation times. We present two novel recovery algorithms that employ distinct sampling methods of the solution of the IVP. Algorithm 1 combines discrete and weighted average measurements, whereas Algorithm 2 uses a different variant of weighted average measurements. We analyze the performance of these algorithms, providing upper bounds on the recovery errors of the model parameters. Our focus is on the structure of the dynamical samples used by the algorithms and on the error guarantees they yield. 
    more » « less
    Free, publicly-accessible full text available August 1, 2026
  2. null (Ed.)